Doubling Algorithms for Stationary Distributions of Fluid Queues: A Probabilistic Interpretation

نویسندگان

  • Nigel Bean
  • Giang T. Nguyen
  • Federico Poloni
چکیده

Fluid queues are mathematical models frequently used in stochastic modelling. Their stationary distributions involve a key matrix recording the conditional probabilities of returning to an initial level from above, often known in the literature as the matrix Ψ. Here, we present a probabilistic interpretation of the family of algorithms known as doubling, which are currently the most effective algorithms for computing the return probability matrix Ψ. To this end, we first revisit the links described in [18, 10] between fluid queues and Quasi-Birth-Death processes; in particular, we give new probabilistic interpretations for these connections. We generalize this framework to give a probabilistic meaning for the initial step of doubling algorithms, and include also an interpretation for the iterative step of these algorithms. Our work is the first probabilistic interpretation available for doubling algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fluid Models for Multiserver Queues with Abandonments

Deterministic fluid models are developed to provide simple first-order performance descriptions for multi-server queues with abandonment under heavy loads. Motivated by telephone call centers, the focus is on multi-server queues with a large number of servers and non-exponential service-time and time-to-abandon distributions. The first fluid model serves as an approximation for the G/GI/s + GI ...

متن کامل

Componentwise accurate fluid queue computations using doubling algorithms

Markov-modulated fluid queues are popular stochastic processes frequently used for modelling real-life applications. An important performance measure to evaluate in these applications is their steady-state behaviour, which is determined by the stationary density. Computing it requires solving a (nonsymmetric) M-matrix algebraic Riccati equation, and indeed computing the stationary density is th...

متن کامل

Fluid Queues Driven by a Discouraged Arrivals Queue

We consider a fluid queue driven by a discouraged arrivals queue and obtain explicit expressions for the stationary distribution function of the buffer content in terms of confluent hypergeometric functions. We compare it with a fluid queue driven by an infinite server queue. Numerical results are presented to compare the behaviour of the buffer content distributions for both these models. 1. I...

متن کامل

A Unified Analysis to the Queue Length Distributions in MX(k)/G/1/N and GI/MY(k)/1/N Queues

, Abstract We study an eMcient iterative algorithm fbr computing the stationary distributions ih MX/G/IZN queues with arbitrary state-dependent arrivals, that is, ., MX(k)/C/1/N queues. MX(k)/G/1/N queues include the well studied specidl cases, such as PBAS (partially batch acceptance strategy) At(,X/G/1/N queues and tt WBAS (whole batch acceptance strategy) MX/C/1/N queues. We only require the...

متن کامل

Stationary Processes

Stationary processes are stochastic processes whose probabilistic structure is unaffected by shifts in time. According to the interpretation of the term “probabilistic structure”, one distinguishes weak sense stationary processes, where only the covariance structure is supposed to be invariant, and strict sense stationary processes, for which all finitedimensional distributions have to remain t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018